A simple proof of the necessity of the failure detector Σ to implement a register in asynchronous message-passing systems
نویسندگان
چکیده
This paper presents a simple proof that the quorum failure detector class (denoted Σ) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of process crashes. Key-words: Asynchronous message-passing system, Atomic register, Necessity proof, Process crash, Weakest failure detector. Une preuve simple de la nécessité du détecteur de fautes Σ pour implémenter un registre dans un système asynchrone à passage de messages Résumé : Ce rapport propose une preuve simple de la nécessité du détecteur de fautes Σ pour implémenter un registre dans un système asynchrone à passage de messages. Mots clés : Asynchronisme, Défaillances des processus, Détecteur de fautes, Preuve de nćessité, Registre atomique. * Projet ASAP: équipe commune avec l’INRIA, le CNRS, l’université Rennes 1 et l’INSA de Rennes ** Projet ASAP: équipe commune avec l’INRIA, le CNRS, l’université Rennes 1 et l’INSA de Rennes c ©IRISA – Campus de Beaulieu – 35042 Rennes Cedex – France – +33 2 99 84 71 00 – www.irisa.fr in ria -0 03 92 45 0, v er si on 1 8 Ju n 20 09 2 F. Bonnet & M. Raynal
منابع مشابه
Termination Detection in an Asynchronous Distributed System with Crash-Recovery Failures
We revisit the problem of detecting the termination of a distributed application in an asynchronous message-passing model with crash-recovery failures and failure detectors. We derive a suitable definition of termination detection in this model but show that this definition is impossible to implement unless you have a failure detector which can predict the future. We subsequently weaken the pro...
متن کاملUsing Failure Detectors to Solve Consensus in Asynchronous Shared-memory Systems 1 Background and Overview of Results
Chandra and Toueg proposed a new approach to overcome the impossibility of reaching consensus in asynchronous message-passing systems subject to crash failures 6]. They augment the asynchronous message-passing system with a (possibly unreliable) failure detector. Informally , a failure detector provides some information about the processes that have crashed during an execution of the system. In...
متن کاملFailure Detection Lower Bounds on Registers and Consensus
This paper addresses the problem of determining the weakest failure detector to implement consensus in a message passing system when t out of n processes can crash (including when n/2 ≤ t < n − 1), by addressing the problem of determining the weakest failure detector to implement a register. We complement and, in a precise sense, generalise previous results on the implementability of consensus ...
متن کاملRound-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors
A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a message adversary defines a subset of messages that cannot be eliminated by the adversary. It has recently been shown that when a message adversary is constrained by a property denoted TOUR (for tournament), the corresponding synchronou...
متن کاملMutual exclusion in asynchronous systems with failure detectors
This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denote by T , is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector P . The pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009